Davenport-Schinzel theory of matrices
نویسندگان
چکیده
منابع مشابه
Davenport-Schinzel theory of matrices
Filredi, Z. and P. Hajnal, Davenport-Schinzel theory of matrices, Discrete Mathematics 103 (1992) 233-251. Let C be a configuration of 1’s. We define f(n; C) to be the maximal number of l’s in a O-l matrix of size n x n not having C as a subconfiguration. We consider the problem of determining the order off (n; C) for several forbidden C’s. Among other results we prove that f (n; (’ 1 ’ J) = @(...
متن کامل8. Davenport-schinzel Sequences
Definition 18.1 A (n, s)-Davenport-Schinzel sequence is a sequence over an alphabet A of size n in which no two consecutive characters are the same and there is no alternating subsequence of the form .
متن کاملLower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices
An order-s Davenport-Schinzel sequence over an n-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length s+2. The main problem is to determine the maximum length of such a sequence, as a function of n and s. When s is fixed this problem has been settled (see Agarwal, Sharir, and Shor [1], Nivasch [12] and Pettie [15]) but when s is a function of n, very li...
متن کاملGeneralized Davenport-Schinzel Sequences
The extremal function Ex(u, n) (introduced in the theory of DavenportSchinzel sequences in other notation) denotes for a fixed finite alternating sequence u = ababa . . . the maximum length of a finite sequence v over n symbols with no immediate repetition which does not contain u. Here (following the idea of J. Nešetřil) we generalize this concept for arbitrary sequence u. We summarize the alr...
متن کاملOn numbers of Davenport-Schinzel sequences
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bijective encoding of such sequences by rooted plane trees with distinguished nonleaves and we give a combinatorial proof of the formula 1 k − n+ 1 ( 2k − 2n k − n )( k − 1 2n− k − 1 ) for the number of such normalized seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90316-8